The vertex set of a 01-polytope is strongly P-enumerable
نویسندگان
چکیده
منابع مشابه
The vertex set of a 0/1-polytope is strongly P-enumerable
In this paper, we discuss the computational complexity of the following enumeration problem: given a rational convex polyhedron P defined by a system of linear inequalities, output each vertex of P. It is still an open question whether there exists an algorithm for listing all vertices in running time polynomial in the input size and the output size. Informally speaking, a linear running time i...
متن کاملOn the feedback vertex set polytope of a series-parallel graph
The minimum weight feedback vertex set problem (FVS) on series-parallel graphs can be solved in O(n) time by dynamic programming. This solution, however, does not provide a “nice” certificate of optimality. We prove a min-max relation for FVS on series-parallel graphs with no induced subdivision of K2,3 (a class of graphs containing the outerplanar graphs), thereby establishing the existence of...
متن کاملCliques, holes and the vertex coloring polytope
Certain subgraphs of a given graph G restrict the minimum number χ(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of such subgraphs are related to the celebrated Strong Perfect Graph Theorem, as it implies that every graph G contains a clique of size χ(G), or an odd hole or an odd anti-hole as an induced subgraph. In thi...
متن کاملSeeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, finding a perfect matching when one exists can also be done in NC [8, 7]. However in general planar graphs (when the bipartite condition is removed), no NC algorithm for constructing a perfect matching is known. We ad...
متن کاملCritical Facets of the Stable Set Polytope
A facet of the stable set polytope of a graph G can be viewed as a generalization of the notion of an-critical graph. We extend several results from the theory of-critical graphs to facets. The defect of a nontrivial, full-dimensional facet P v2V a(v)x v b of the stable set polytope of a graph G is deened by = P v2V a(v) ?2b. We prove the upper bound a(u) + for the degree of any vertex u in a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(98)00021-2